“Fractal” Types: an Attempt to Generalize Hash Table Calculation
نویسنده
چکیده
This paper addresses a class of generic program calculations which aim at introducing concurrency into programs by changing data-structure representations. The approach will be restricted to the fairly common situation in which the calculated program (implementation) runs at a level of abstraction lower than that of the starting program (specification). This conforms to the following quotation from [12]:
منابع مشابه
Vortex-ring Modeling of Complex Systems and Mendeleev’s Table
This paper is an attempt to attain a new and profound model of the nature’s structure using a vortex-fractal theory (VFT). Scientists try to explain some phenomena in Nature that have not been explained so far. The aim of this paper is the vortex-fractal modeling of vortex-ring fractal structure of atoms, molecules, and a creation of elements in the Mendeleev’s periodic table with vortex-ring p...
متن کاملAn Exponential Open Hashing Function Based on Dynamical Systems Theory
In this paper an eecient open addressing hash function called exponential hashing is developed using concepts from dynamical systems theory and number theory. A comparison of exponential hashing versus a widely-used double hash function is performed using an analysis based on Lya-punov exponents and entropy. Proofs of optimal table parameter choices are provided for a number of hash functions. ...
متن کاملMemory Reduction Method for Specific Object Recognition Based on Lossy Encoding of Feature Vectors with a Bloomier Filter
Specific object recognition method with the nearest neighbor search of local features needs an immense of memory storage to store them for distance calculation since the number of local features is very large. A way to solve this problem is to skip the distance calculation. In this paper, we propose a memory reduction method with a Bloomier filter which is far memory efficient than hash tables....
متن کاملA Method of Memory Reduction for Specific Object Recognition with a Bloomier Filter
Specific object recognition based on nearest neighbor search of feature vectors requires a huge amount of memory to store all feature vectors for distance calculation. To solve this problem, we propose a memory reduction method for specific object recognition with no distance calculation for matching feature vectors. The proposed method is characterized by the use of a Bloomier filter, which is...
متن کاملPerfect hash table algorithm for image databases using negative associated values
A 2D string data structure allows for e cient spatial reasoning on an image database for query and retrieval. A 2D string can be converted to a set of triples leading to an elegant O(1) solution for image retrieval with simple queries using a perfect hash table. For complex queries, the retrieval complexity is linear in this approach and depends on the number of possible pairings of picture obj...
متن کامل